Primeness of right orders in full linear rings

Primeness in Near-rings of Continuous Functions

Various types of primeness have been considered for near-rings. One of these is the concept of equiprime, which was defined in 1990 by Booth, Groenewald and Veldsman. We will investigate when the near-ring N0(G) of continuous zeropreserving self maps of a topological group G is equiprime. This is the case when G is either T0 and 0-dimensional or T0 and arcwise connected. We also give conditions...

Primeness in Near - rings of Continuous Functions 2

This paper is a continuation of work done by the present author together with P. R. Hall [1]. We characterise the prime and equiprime radicals of N0(G) for certain topological groups G. Various results are obtained concerning primeness and strongly primeness for the sandwich near-ring N0(G,X, θ). MSC 2000: 16Y30, 22A05

Optimal Tableaux for Right Propositional Neighborhood Logic over Linear Orders

The study of interval temporal logics on linear orders is a meaningful research area in computer science and artificial intelligence. Unfortunately, even when restricted to propositional languages, most interval logics turn out to be undecidable. Decidability has been usually recovered by imposing severe syntactic and/or semantic restrictions. In the last years, tableau-based decision procedure...

Cofinalities of Linear Orders

Cuts of Linear Orders

We study the connection between the number of ascending and descending cuts of a linear order, its classical size, and its effective complexity (how much [how little] information can be encoded into it).